33. Search in Rotated Sorted Array - LeetCode Solution

class Solution:
    def search(self, nums: List[int], target: int) -> int:

        start = 0

        end = len(nums) - 1

        if len(nums) == 0:
            return -1

        value = -1

        while (start <= end):
            mid = (start + end) // 2

            if mid > 0 and nums[mid] < nums[mid - 1]:
                value = mid
                break

            if nums[start] <= nums[mid] > nums[end]:
                start = mid + 1
            else:
                end = mid - 1

            value = start


        def binarySearch(start, end):
            while start<=end:
                mid = (start+end)//2


                if nums[mid] == target:
                    return mid
                elif nums[mid] > target:
                    end = mid-1
                else:
                    start = mid+1


            return -1



        x = [binarySearch(value, len(nums) -1), binarySearch(0, value-1)]

        print(max(x))
        return max(x)